Three New Complexity Results for Resource Allocation Problems
نویسنده
چکیده
We prove the following results for task allocation of indivisible resources: • The problem of finding a leximin-maximal resource allocation is in P if the agents have max-utility functions and atomic demands. • Deciding whether a resource allocation is Pareto-optimal is coNP-complete for agents with (1-)additive utility functions. • Deciding whether there exists a Pareto-optimal and envy-free resource allocation is Σp2-complete for agents with (1-)additive utility functions.
منابع مشابه
A New Fairness Index and Novel Approach for QoS-Aware Resource Allocation in LTE Networks Based on Utility Functions
Resource allocation techniques have recently appeared as a widely recognized feature in LTE networks. Most of existing approaches in resource allocation focus on maximizing network’s utility functions. The great potential of utility function in improving resource allocation and enhancing fairness and mean opinion score (MOS) indexes has attracted large efforts over the last few years. In this p...
متن کاملطراحی لایه- متقاطع برای کنترل ازدحام، مسیریابی و زمان‌بندی در شبکه‌های بی‌سیم ad-hocبا در نظر‌گرفتن توان الکتریکی گره‌ها
Abstract Ad hoc Wireless Networks, are networks formed by a collection of nodes through radio. In wireless networking environment, formidable challenges are presented. One important challenge is connection maintenance mechanism for power consumption. In this paper, a multi-objective optimal design is considered for ad-hoc networks which address the electrical power of nodes effects on cross-l...
متن کاملParametrical Approach for Bilinear Programming and its Application for solving Integer and Combinatorial Optimization Problems
A parametrical approach for bilinear programming is proposed and new algorithms on the basis of such approach for solving linear boolean and resource allocation problems are developed. Computational complexity of the proposed algorithms is discussed. Mathematics subject classification: 65K05, 68W25.
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملNew results for discrete-continuous mean flow time scheduling problems
The problem of scheduling n jobs under discrete-continuous resources to minimise the mean flow time is revisited. The job's processing rate is a continuous increasing function fi , i = 1,..., n of the amount of the discrete resource allotted to this job at a time. The problem can be solved in polynomial time if fi = f, i = 1, ..., n. New results concerning the optimal resource allocation for pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0810.0532 شماره
صفحات -
تاریخ انتشار 2008